Connes’ Embedding Problem and Lance’s Wep
نویسنده
چکیده
A II1-factor embeds into the ultraproduct of the hyperfinite II1-factor if and only if it satisfies the von Neumann algebraic analogue of Lance’s weak expectation property (WEP). This note gives a self contained proof of this fact.
منابع مشابه
Tracial Invariants, Classification and Ii1 Factor Representations of Popa Algebras
Using various finite dimensional approximation properties, four convex subsets of the tracial space of a unital C∗-algebra are defined. One subset is characterized by Connes’ hypertrace condition. Another is characterized by hyperfiniteness of GNS representations. The other two sets are more mysterious but are shown to be intimately related to Elliott’s classification program. Applications of t...
متن کاملConnes ’ embedding problem and Tsirelson ’ s problem
We show that Tsirelson’s problem concerning the set of quantum correlations and Connes’ embedding problem on finite approximations in von Neumann algebras (known to be equivalent to Kirchberg’s QWEP conjecture) are essentially equivalent. Specifically, Tsirelson’s problem asks whether the set of bipartite quantum correlations generated between tensor product separated systems is the same as the...
متن کاملComputability and the Connes Embedding Problem
The Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the statement that every type II1 tracial von Neumann algebra has a computable universal theory.
متن کاملAlgebraic reformulation of Connes embedding problem and the free group algebra
We give a modification of I. Klep and M. Schweighofer algebraic reformulation of Connes’ embedding problem by considering ∗-algebra of the countably generated free group. This allows to consider only quadratic polynomials in unitary generators instead of arbitrary polynomials in self-adjoint generators.
متن کاملA Computability-theoretic Reformulation of the Connes Embedding Problem
The Connes Embedding Problem (CEP) asks whether every separable II1 factor embeds into an ultrapower of the hyperfinite II1 factor. We show that the CEP is equivalent to the computability of the universal theory of every type II1 von Neumann algebra. We also derive some further computability-theoretic consequences of the CEP.
متن کامل